基于误差估值累加开环校正的诱导式欺骗检测方法

诱导式卫星欺骗干扰可诱导航空器逐渐偏离预定航迹，难以被发现，因此及时有效地检测干扰是飞行安全的保障。在现有紧组合导航体制基础上，设计了一种基于误差估值累加开环校正的紧组合导航结构，并证明了其性能与传统闭环校正紧组合导航性能等效。在此结构中，将紧组合导航系统与自适应序贯概率比检测方法结合，提出了一种基于误差估值累加开环校正的诱导式欺骗检测方法，融合紧组合导航信息与其他不受欺骗影响的导航信息，构建欺骗检测统计量进行诱导式欺骗检测。仿真结果表明，开环校正结构可避免随时间累加的惯性导航系统误差所导致的组合导航滤波器发散问题，同时欺骗检测方法可进一步提高算法对“最坏”情形下微小诱导式欺骗的检测效果。     

基于VMD和BSA-KELM的高陡边坡位移预测模型研究

边坡位移的时间序列曲线存在复杂的非线性特性,传统的预测模型精度不足以满足预测要求。为此提出了基于变分模态分解的鸟群优化-核极限学习机的预测模型,并用于河北省某水泥厂的边坡位移预测。该方法首先采用VMD把边坡位移序列分解为一系列的有限带宽的子序列,再对各子序列分别采用相空间重构并用核极限学习机预测,采用鸟群算法优化相空间重构的嵌入维度和KELM中惩罚系数和核参数三个数值,以取得最优预测模型。最后将各个子序列预测值叠加,得到边坡位移的最终预测值。结果表明：和KELM、BSA-KELM、EEMD-BSA-KELM模型相比,基于VMD的BSA-KELM预测精度更高,为边坡位移的预测提供一种有效的方法。     

Digital twin-based analysis of volumetric error mapping procedures

The evaluation of the volumetric accuracy of a machine tool is an open challenge in the industry, and a wide variety of technical solutions are available in the market and at research level. All solutions have advantages and disadvantages concerning which errors can be measured, the achievable uncertainty, the ease of implementation, possibility of machine integration and automation, the equipment cost and the machine occupation time, and it is not always straightforward which option to choose for each application. The need to ensure accuracy during the whole lifetime of the machine and the availability of monitoring systems developed following the Industry 4.0 trend are pushing the development of measurement systems that can be integrated in the machine to perform semi-automatic verification procedures that can be performed frequently by the machine user to monitor the condition of the machine. Calibrated artefact based calibration and verification solutions have an advantage in this field over laser based solutions in terms of cost and feasibility of machine integration, but they need to be optimized for each machine and customer requirements to achieve the required calibration uncertainty and minimize machine occupation time.This paper introduces a digital twin-based methodology to simulate all relevant effects in an artefact-based machine tool calibration procedure, from the machine itself with its expected error ranges, to the artefact geometry and uncertainty, artefact positions in the workspace, probe uncertainty, compensation model, etc. By parameterizing all relevant variables in the design of the calibration procedure, this simulation methodology can be used to analyse the effect of each design variable on the error mapping uncertainty, which is of great help in adapting the procedure to each specific machine and user requirements. The simulation methodology and the analysis possibilities are illustrated by applying it on a 3-axis milling machine tool.     

广义正交码索引调制系统的性能分析

摘 要：为了提高码索引调制（code index modulation，CIM）系统的传输效率，提出了一种具有更低复杂度的单输入单输出（single input single output，SISO）的广义正交码索引调制（generalized orthogonal code index modulation，GQCIM）系统。CIM 系统使用扩频码和星座符号传输信息，但只能激活两个扩频码索引和一个调制符号。而 GQCIM 系统以一种新颖的方式克服了只激活一个调制符号的限制，同时充分利用了调制符号的正交性，增加扩频码索引以传输更多的额外信息位，提高了系统的传输效率。此外，分析了GQCIM系统的理论性能，推导了误码率性能的上界。通过蒙特卡罗仿真验证了GQCIM系统的性能，对比发现GQCIM系统的理论和仿真性能一致。而且在相同的传输效率下，结果显示GQCIM系统的性能优于同样具有正交性的调制系统，如广义码索引调制（generalized code index modulation，GCIM）系统、CIM系统、码索引调制-正交空间调制（code index modulation aided quadrature spatial modulation，CIM-QSM）系统、码索引调制-正交空间调制（code index modulation aided spatial modulation，CIM-SM）系统、脉冲索引调制（pulse index modulation，PIM）系统。     

Efficient Flexible M-Tree Bulk Loading Using FastMap and Space-Filling Curves

Many database applications currently deal with objects in a metric space. Examples of such objects include unstructured multimedia objects and points of interest (POIs) in a road network. The M-tree is a dynamic index structure that facilitates an efficient search for objects in a metric space. Studies have been conducted on the bulk loading of large datasets in an M-tree. However, because previous algorithms involve excessive distance computations and disk accesses, they perform poorly in terms of their index construction and search capability. This study proposes two efficient M-tree bulk loading algorithms. Our algorithms minimize the number of distance computations and disk accesses using FastMap and a space-filling curve, thereby significantly improving the index construction and search performance. Our second algorithm is an extension of the first, and it incorporates a partitioning clustering technique and flexible node architecture to further improve the search performance. Through the use of various synthetic and real-world datasets, the experimental results demonstrated that our algorithms improved the index construction performance by up to three orders of magnitude and the search performance by up to 20.3 times over the previous algorithm.     

Context-free grammars to detect straight segments and a novel polygonal approximation method

A new method for the polygonal approximation is presented. The method is based on the search for break points through a context-free grammar, that accepts digital straight segments with loss of information, as well as the decrease in the error committed employing the comparison of a tolerable error. We present an application of our method to different sets of objects widely used, as well as a comparison of our results with the best results reported in the literature, proving that our method achieves better values of error criteria. Besides, a new way to find polygonal approximations, with context-free grammars to recognize digital straight segments without loss of pixels, it is also addressed.     

An improved feedrate scheduling method for NURBS interpolation in five-axis machining

Five-axis machining plays an important role in manufacturing by dint of its high efficiency and accuracy. While two rotation axes benefit the flexibility of machining, it also brings limitations and challenges. In order to further balance machining precision and efficiency, an improved feedrate scheduling method is presented considering geometric error and kinematic constraints for the Non Uniform Rational B-Spline (NURBS) interpolation in five-axis machining. A simplification method is proposed to calculate the geometric error which describes the deviation between the ideal tool path and the real tool path induced by the non-linear movement. A linear relation between geometric error and feedrate is built to limit the feedrate. The constraints determined by single axis kinematic performance and tangential kinematic performance are also considered. Under these constraints, a constrained feedrate profile is determined. Aiming to get more constant feedrate in the difficult-to-machine areas, this work proposes a scheduling method which combines morphological filtering and S-shape acceleration/deceleration (acc/dec) mode. Simulations and experiments are performed to compare the proposed feedrate scheduling method with two previous feedrate scheduling method and the results prove that the proposed feedrate scheduling method is reliable and effective.     

干扰条件下的“北斗”信号解扩重构DOA估计

在干扰条件下，卫星导航抗干扰波束形成算法往往需要卫星信号波达方向（Direction-of-Arrival，DOA）的先验信息。但当存在低信噪比信号或主动干扰源时，常规的DOA估计算法性能急剧下降甚至失效。针对此问题，提出了一种被干扰信号压制的低信噪比“北斗”信号的DOA估计算法。该算法首先通过对接收信号进行子空间投影抑制干扰信号，然后对抑制干扰后的信号进行解扩重构处理，最后通过多重信号分类算法完成对“北斗”信号的DOA估计。仿真结果表明，在干扰信号干信比80 dB条件下，“北斗”信号DOA估计误差在5°以内，为下一步进行波束形成计算提供了高精度的入射角信息。     

Unreliable numbers: error and harm induced by bad design can be reduced by better design

Number entry is a ubiquitous activity and is often performed in safety- and mission-critical procedures, such as healthcare, science, finance, aviation and in many other areas. We show that Monte Carlo methods can quickly and easily compare the reliability of different number entry systems. A surprising finding is that many common, widely used systems are defective, and induce unnecessary human error. We show that Monte Carlo methods enable designers to explore the implications of normal and unexpected operator behaviour, and to design systems to be more resilient to use error. We demonstrate novel designs with improved resilience, implying that the common problems identified and the errors they induce are avoidable.     

基于三维胞元空间的MA双向并行路由算法

针对传统移动代理(MA)在监测无线传感器网络(WSNs)的感兴趣信息时产生的延迟较大和能耗较多问题,提出了基于三维胞元空间的MA双向并行(3D-BPMA)路由算法.3D-BPMA将MA与传统的客户/服务器(c/S)模式相结合,在胞元内利用C/S模式搜集信息,在单层胞元系统和路由器与路由器之间采用MA双向并行的策略进行传输.仿真结果表明:3D-BPMA与LCF,DSG-MIP算法相比减少了平均响应时间和网络平均能耗,提高了MA发送率.